Individual Reuse in Description Logic Reasoning

نویسندگان

  • Boris Motik
  • Ian Horrocks
چکیده

Tableau calculi are the state-of-the-art for reasoning in description logics (DL). Despite recent improvements, tableau-based reasoners still cannot process certain knowledge bases (KBs), mainly because they end up building very large models. To address this, we propose a tableau calculus with individual reuse: to satisfy an existential assertion, our calculus nondeterministically tries to reuse individuals from the model generated thus far. We present two expansion strategies: one is applicable to the DL ELOH and gives us a worst-case optimal algorithm, and the other is applicable to the DL SHOIQ. Using this technique, our reasoner can process several KBs that no other reasoner can.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

K−ShaRe: an architecture for sharing heterogeneous conceptualisations

We propose an architecture for the development of an intelligent knowledge management environment based on description logics. This environment addresses the problem of heterogeneous reasoning underpinning knowledge analysis, sharing, and reuse. We explicitly focus on selectively variable expressive power, hybrid reasoning about expressive knowledge, and heuristic lexical reasoning, with major ...

متن کامل

WSML Deliverable D 16 . 2 v 0 . 2 WSML Reasoning Implementation WSML Working Draft

This deliverable will provide reasoner implementations for the variants of the WSML family of languages. In its current version, this deliverable lists the requirements posed by the different WSML variants on the reasoner implementation and provides a survey of existing reasoners. The reasoners surveyed in this deliverable range from logic programming engines to description logic reasoners and ...

متن کامل

A Knowledge Engineering and Planning Framework based on OWL Ontologies

In this paper, we describe a domain-independent, general purpose knowledge engineering and planning framework that supports the construction of planning domains and problems based on OWL ontologies, and the integration of the planning process with description logic (DL) reasoning. The use of OWL ontologies as a basis for modeling domains allows the reuse of existing knowledge in the Semantic We...

متن کامل

A Distributed Tableau Algorithm for Package-based Description Logics

Package-based Description Logics (P-DL) is a novel formalism for modular ontologies. In P-DL, an ontology is composed of a collection of modules called packages. A package can partially reuse knowledge in other packages by a selective importing mechanism. This paper investigates a sound and complete tableau-based reasoning algorithm for a P-DL language ALCPC , which extends ALC with acyclic con...

متن کامل

Reasoning About Inheritance and Unrestricted Reuse in Object-Oriented Concurrent Systems

Code reuse is a fundamental aspect of object-oriented programs, and in particular, the mechanisms of inheritance and late binding provide great flexibility in code reuse, without semantical limitations other than typecorrectness. However, modular reasoning about late binding and inheritance is challenging, and formal reasoning approaches place semantical restrictions on code reuse in order to p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008